This commit clean up time handling when playing eg. lichess games where
there is no max moves rule.
This is definitely not final, but it's better than before.

Also removed some commented out code. Sorry..

Signed-off-by: Hans Binderup <[email protected]>

The PV table would previously have the same size as the max search
depth. This is problematic as the copy of moves will be into n+1.
Therefore we need an extra layer hence increasing the size of the tables
by one.

Without this the tables will overflow when reaching the max search
depth.

Signed-off-by: Hans Binderup <[email protected]>

Instead of our simple eval it was time to implement a more sophisticated
material evaluation.
A common evaluation method is called "pesto". Read more here:
https://www.chessprogramming.org/PeSTO%27s_Evaluation_Function

Signed-off-by: Hans Binderup <[email protected]>

Promotion moves are usually quite good, so let's try them first as well.

Signed-off-by: Hans Binderup <[email protected]>